منابع مشابه
Optimizing reduced-space sequence analysis
MOTIVATION Dynamic programming is the core algorithm of sequence comparison, alignment and linear hidden Markov model (HMM) training. For a pair of sequence lengths m and n, the problem can be solved readily in O(mn)time and O(mn)space. The checkpoint algorithm introduced by Grice et al. (CABIOS, 13, 45--53, 1997) runs in O(Lmn)time and O(Lm(L) square root of n)space, where L is a positive inte...
متن کاملReduced space sequence alignment
MOTIVATION Sequence alignment is the problem of finding the optimal character-by-character correspondence between two sequences. It can be readily solved in O(n2) time and O(n2) space on a serial machine, or in O(n) time with O(n) space per O(n) processing elements on a parallel machine. Hirschberg's divide-and-conquer approach for finding the single best path reduces space use by a factor of n...
متن کاملOn optimizing multi-sequence functionals for competitive analysis
The efficiency of an online motion planning algorithm often is measured by a constant competitive factor C. Competitivity means, that the cost of an Ccompetitive online strategy with incomplete information is only C times worse than the optimal offline solution with full information. If a strategy is represented by an infinite sequence X = f1, f2, . . ., the problem of finding a strategy with m...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملWeyl Spreading Sequence Optimizing CDMA
Recently, the new spreading sequence obtained by the Weyl sequence is proposed for CDMA systems. Its crosscorrelation function follows O( 1 N ), where N is the code length of the spreading sequence. In this paper, we optimize the Weyl sequence code design to assign to each user for CDMA systems and we analytically calculate its theoretical SIR (Signal to Interference Noise Ratio). It is theoret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2000
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/16.12.1082